On the theory and performance of trellis termination methods for turbo codes

نویسندگان

  • Johan Hokfelt
  • Ove Edfors
  • Torleiv Maseng
چکیده

The performance of a Turbo code can be severely degraded if no trellis termination is employed. This paper investigates the implications of the choice of trellis termination method for Turbo codes, and explains the origin of the performance degradation often experienced without trellis termination. An efficient method to derive the distance spectrum of Turbo codes for different trellis termination methods is presented. Further, we present interleaver design rules that are tailored to each termination method. Using interleavers designed with these restrictions, we demostrate that the performance difference between various termination methods are very small, including no trellis termination at all. For example, we demonstrate a Turbo code with a 500-bit interleaver that exhibits no sign of an error floor for frame error rates as low as 10−8, even though no trellis termination is employed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Study on methods of the trellis termination of the convolutional codes components of the turbo-codes

This paper makes a comparison in terms of the bit error rate (BER) and frame error rate (FER) versus signal to noise ratio (SNR) between the different methods of the trellis termination of the recursive, systematic, single and double-binary convolutional codes used in turbo-codes. The best four well known termination methods were investigated: circular (tailbiting), single-termination, interlea...

متن کامل

Influence of Trellis Termination Methods on Turbo Codes Performances over Middleton Class-a Channels

Turbo codes occupy a special place in the field of wireless communications for their outstanding performances in correcting errors that appear on transmission channels. This paper analyzes the influence of trellis termination methods on turbo codes performances, over a channel affected by impulsive noise and Binary Phase-Shift Keying modulation. The statistical model used for the impulsive nois...

متن کامل

Turbo Codes for PCS Applications

Turbo codes are the most exciting and potentially important development in coding theory in many years. They were introduced in 1993 by Berrou, Glavieux and Thitimajshima [1], and claimed to achieve near Shannon-limit error correction performance with relatively simple component codes and large interleavers. A required Eb/No of 0.7 dB was reported for BER of 10−5 and code rate of 1/2 [1]. Howev...

متن کامل

Turbo-code Termination Schemes and a Novel Alternative for Short Frames

Recently a coding scheme, termed turbo-codes was proposed, which achieves results very close to the Shannon-limit. The encoding and decoding of turbo-codes is reviewed. In particular, a comparison of the current methods used for terminating the trellis of the turbo-code are described. A novel approach to termination of the code is introduced which removes the need to transmit tail bits across t...

متن کامل

Application and standardization of turbo codes in third-generation high-speed wireless data services

This paper addresses the application of turbo codes for third-generation wireless services. It describes the specific characteristics of high-rate data applications in third-generation wide-band code-division multiple-access (CDMA) systems that make turbo codes superior to convolutional codes. In particular, it shows the positive effect of fast power control employed in these systems on the rel...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Journal on Selected Areas in Communications

دوره 19  شماره 

صفحات  -

تاریخ انتشار 2001